package com.vilynn.interview.leetcode;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Solution621 {

    public int leastInterval(char[] tasks, int n) {
        Set<Character> map = new HashSet<>();
        List<Integer> list = new ArrayList<>();

        int time = 0;

        for (int i = 0; i < tasks.length; i++) {

        }

        return time;
    }
}